In this paper, we introduce the notion of secure point-set domination in graphs. A point-set dominating D of graph G is called a secure point-set dominating set if for every vertex u ∈ V −D, there exists a vertex v ∈ D∩N(u) ...